An error-free algorithm to solve a linear system of polynomial equations

The paper presents an error-free algorithm to solve a system of linear equations with polynomial coefficients. Modular arithmetic in residual polynomial class and in residual numeric class is employed. The algorithm is iterative and well suited for implementation for computers with vector operations and fast and error-free convolutors.     

Global existence of solutions for semilinear damped wave equation in 2-D exterior domain

We consider a mixed problem of a damped wave equation u_tt−Δu+u_t=|u|^p in the two dimensional exterior domain case. Small global in time solutions can be constructed in the case when the power p on the nonlinear term |u|^p satisfies p∗=2<p<+∞. For this purpose we shall deal with a radially symmetric solution in the exterior domain. A new device developed in Ikehata-Matsuyama (Sci. Math. Japon. 55 (2002) 33) plays an effective role.     

Mixed constrained control problems

Necessary optimality conditions are derived in the form of a weak maximum principle for optimal control problems with mixed state-control equality and inequality constraints. In contrast to previous work these conditions hold when the Jacobian of the active constraints, with respect to the unconstrained control variable, has full rank. A feature of these conditions is that they are stated in terms of a joint Clarke subdifferential. Furthermore the use of the joint subdifferential gives sufficiency for nonsmooth, normal, linear convex problems. The main point of interest is not only the full rank condition assumption but also the nature of the analysis employed in this paper. A key element is the removal of the constraints and application of Ekeland's variational principle.     

Goldbach猜想在N3[12,22,32,……]中的推广

文[1]已将Goldbach猜想推广到N2[1^2，2^2，3^2，……]中去，本文除了仿[1]将此猜想推广到N3[1^2，2^2，3^2，……]，此外，还引进与Goldbach猜想对偶的另一猜想．借以研究N3[1^2，2^2，3^2，……]中之偶数表示为不同奇数的线性组合问题，得到可以补救[1]中所用方法之缺陷的新的结果．并由此提出另外的有意义的猜想．     

Uniform saturation in linear inequality systems

Redundant constraints in linear inequality systems can be characterized as those inequalities that can be removed from an arbitrary linear optimization problem posed on its solution set without modifying its value and its optimal set. A constraint is saturated in a given linear optimization problem when it is binding at the optimal set. Saturation is a property related with the preservation of the value and the optimal set under the elimination of the given constraint, phenomena which can be seen as weaker forms of excess information in linear optimization problems. We say that an inequality of a given linear inequality system is uniformly saturated when it is saturated for any solvable linear optimization problem posed on its solution set. This paper characterizes the uniform saturated inequalities and other related classes of inequalities. This work was supported by the MCYT of Spain and FEDER of UE, Grant BFM2002-04114-C02-01.     

Decision support for the career field selection process at the US Air Force Academy

Each year, the US Air Force Academy graduates nearly 1000 young men and women. To support the decision of which cadets will be classified into which career fields, we describe a linear programming formulation with appealing computational properties that enable it as the core of a decision support tool. We explore methods for measuring and balancing cadets' class standing, Air Force career field requirements, and cadets' career field preferences in the context of this model. Our computational experiments demonstrate the improvement of this method over previous classification approaches, yielding more than 10% increase in the number of cadets assigned to their top career field choice and yielding nearly a 100% reduction in the number of cadets not receiving any of their career field choices. We also explore alternative methods for measuring cadets' career field preferences and demonstrate the positive effect of the new measurement scheme on the overall classification. Because of the short running time of this model, it will serve as a flexible, real-time component of the Academy's classification process.     

Some Conditions for Matrices over an Incline To Be Invertible and General Linear Group on an Incline

Inclines are the additively idempotent semirings in which products are less than or equal to either factor. In this paper, some necessary and sufficient conditions for a matrix over L to be invertible are given, where L is an incline with 0 and 1. Also it is proved that L is an integral incline if and only if GLn（L） = PLn （L） for any n （n 〉 2）, in which GLn（L） is the group of all n × n invertible matrices over L and PLn（L） is the group of all n × n permutation matrices over L. These results should be regarded as the generalizations and developments of the previous results on the invertible matrices over a distributive lattice.     

Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited

Recently, Zhang, Tapia, and Dennis (Ref. 1) produced a superlinear and quadratic convergence theory for the duality gap sequence in primal-dual interior-point methods for linear programming. In this theory, a basic assumption for superlinear convergence is the convergence of the iteration sequence; and a basic assumption for quadratic convergence is nondegeneracy. Several recent research projects have either used or built on this theory under one or both of the above-mentioned assumptions. In this paper, we remove both assumptions from the Zhang-Tapia-Dennis theory.Dedicated to the Memory of Magnus R. Hestenes, 1906–1991This research was supported in part by NSF Cooperative Agreement CCR-88-09615 and was initiated while the first author was at Rice University as a Visiting Member of the Center for Research in Parallel Computation.The authors thank Yinyu Ye for constructive comments and discussions concerning this material.This author was supported in part by NSF Grant DMS-91-02761 and DOE Grant DE-FG05-91-ER25100.This author was supported in part by AFOSR Grant 89-0363, DOE Grant DE-FG05-86-ER25017, and ARO Grant 9DAAL03-90-G-0093.     

A least-squares method for solving the mixed form of the groundwater flow equations

The mixed form of the areal groundwater flow equations is solved with a least-squares finite element procedure (LESFEM). Hydraulic head and x- and y-directed fluxes are state variables. Physical parameters and state variables are approximated using a bilinear basis. Grid refinements and irregular domain boundaries are implemented on rectangular meshes. Residuals are constructed at collocation points for conservation of mass and Darcy's law. Boundary condition residuals are constructed at discrete points along the boundary. The residuals are weighted, squared and summed. A set of algebraic equations is formed by taking the derivatives of the weighted sum of the squares of the residuals with respect to each unknown parameter in the approximation for the state variable and setting them to zero. Proper choice of a potential scaling parameter and residual weights is essential for the effective application of the algorithm. Test problem results demonstrate that the method is effective for both transient and steady state cases. The LESFEM algorithm generates a C°-continuous velocity field. The continuous velocity field and the rectangular mesh simplify the implementation of algorithms that require tracking. In addition, rectangular meshes simplify mesh and boundary generation.     

Selective lumping finite element method for nearshore current

A finite element method for the analysis of nearshore current, which is one of the principal currents in coastal seas, is presented in this paper. Because the nearshore current is induced by the variable distribution of the surface waves, it is necessary to analyse two main characteristics of the wave, i.e. direction and height. The current can be computed using the resulting wave characteristics. The present method makes it possible to employ procedures for which the same methods of solution are applicable for all basic equations of wave direction, height and current flow. The linear interpolation function is used for the discretization of spatial variables and a selective lumping two step explicit scheme is employed for the numerical integration in time. The numerical solutions obtained are compared with analytical, experimental and observed ones. From these comparative studies, it is concluded that the present finite element method provide a useful tool for the analysis of nearshore current.